2,718 research outputs found

    Accurate and linear time pose estimation from points and lines

    Get PDF
    The final publication is available at link.springer.comThe Perspective-n-Point (PnP) problem seeks to estimate the pose of a calibrated camera from n 3Dto-2D point correspondences. There are situations, though, where PnP solutions are prone to fail because feature point correspondences cannot be reliably estimated (e.g. scenes with repetitive patterns or with low texture). In such scenarios, one can still exploit alternative geometric entities, such as lines, yielding the so-called Perspective-n-Line (PnL) algorithms. Unfortunately, existing PnL solutions are not as accurate and efficient as their point-based counterparts. In this paper we propose a novel approach to introduce 3D-to-2D line correspondences into a PnP formulation, allowing to simultaneously process points and lines. For this purpose we introduce an algebraic line error that can be formulated as linear constraints on the line endpoints, even when these are not directly observable. These constraints can then be naturally integrated within the linear formulations of two state-of-the-art point-based algorithms, the OPnP and the EPnP, allowing them to indistinctly handle points, lines, or a combination of them. Exhaustive experiments show that the proposed formulation brings remarkable boost in performance compared to only point or only line based solutions, with a negligible computational overhead compared to the original OPnP and EPnP.Peer ReviewedPostprint (author's final draft

    Random Lasing Action from Randomly Assembled ZnS Nanosheets

    Get PDF
    Lasing characteristics of randomly assembled ZnS nanosheets are studied at room temperature. Under 266-nm optical excitation, sharp lasing peaks emitted at around 332 nm with a linewidth less than 0.4 nm are observed in all directions. In addition, the dependence of lasing threshold intensity with the excitation area is shown in good agreement with the random laser theory. Hence, it is verified that the lasing characteristics of randomly assembled ZnS nanosheets are attributed to coherent random lasing action

    Ordered arrays of multiferroic epitaxial nanostructures

    Get PDF
    Epitaxial heterostructures combining ferroelectric (FE) and ferromagnetic (FiM) oxides are a possible route to explore coupling mechanisms between the two independent order parameters, polarization and magnetization of the component phases. We report on the fabrication and properties of arrays of hybrid epitaxial nanostructures of FiM NiFe2O4 (NFO) and FE PbZr0.52Ti0.48O3 or PbZr0.2Ti0.8O3, with large range order and lateral dimensions from 200 nm to 1 micron

    Family conflict and lower morning cortisol in adolescents and adults: modulation of puberty

    Get PDF
    published_or_final_versio

    What happens if you single out? An experiment

    Get PDF
    We present an experiment investigating the effects of singling out an individual on trust and trustworthiness. We find that (a) trustworthiness falls if there is a singled out subject; (b) non-singled out subjects discriminate against the singled out subject when they are not responsible of the distinct status of this person; (c) under a negative frame, the singled out subject returns significantly less; (d) under a positive frame, the singled out subject behaves bimodally, either selecting very low or very high return rates. Overall, singling out induces a negligible effect on trust but is potentially disruptive for trustworthiness

    Entanglement detection beyond the CCNR criterion for infinite-dimensions

    Get PDF
    In this paper, in terms of the relation between the state and the reduced states of it, we obtain two inequalities which are valid for all separable states in infinite-dimensional bipartite quantum systems. One of them provides an entanglement criterion which is strictly stronger than the computable cross-norm or realignment (CCNR) criterion.Comment: 11 page

    Quantum Simulation of Tunneling in Small Systems

    Full text link
    A number of quantum algorithms have been performed on small quantum computers; these include Shor's prime factorization algorithm, error correction, Grover's search algorithm and a number of analog and digital quantum simulations. Because of the number of gates and qubits necessary, however, digital quantum particle simulations remain untested. A contributing factor to the system size required is the number of ancillary qubits needed to implement matrix exponentials of the potential operator. Here, we show that a set of tunneling problems may be investigated with no ancillary qubits and a cost of one single-qubit operator per time step for the potential evolution. We show that physically interesting simulations of tunneling using 2 qubits (i.e. on 4 lattice point grids) may be performed with 40 single and two-qubit gates. Approximately 70 to 140 gates are needed to see interesting tunneling dynamics in three-qubit (8 lattice point) simulations.Comment: 4 pages, 2 figure
    corecore